Third-order Idealized Algol with iteration is decidable
نویسندگان
چکیده
منابع مشابه
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗3). They are approached via a combination of game semantics and language theory. It is shown that for each IA∗3-term one can construct a pushdown automaton recognizing a representation of the strategy induced by the term. The automata have some additional prope...
متن کاملObservational Equivalence of 3rd-Order Idealized Algol is Decidable
We prove that observational equivalence of 3rd-order finitary Idealized Algol (IA) is decidable using Game Semantics. By modelling state explicitly in our games, we show that the denotation of a term M of this fragment of IA (built up from finite base types) is a compactly innocent strategy-with-state i.e. the strategy is generated by a finite view function fM . Given any such fM , we construct...
متن کاملIdealized Algol with activeexpressionsExtended
The manipulation of objects with state which changes over time is all-pervasive in computing. Perhaps the simplest example of such objects are the program variables of classical imperative languages. An important strand of work within the study of such languages, pioneered by John Reynolds, focuses on \Idealized Algol", an elegant synthesis of imperative and functional features. We present a no...
متن کاملThe regular-language semantics of second-order idealized ALGOL
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our model inherits its good theoretical properties; in fact, for second-order IA taken as a stand-alone langua...
متن کاملThe Regular-Language Semantics of First-Order Idealized Algol
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our model inherits its good theoretical properties; in fact, for first order IA taken as a stand-alone languag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.09.022